Arithmetic Expressions Optimisation Using Dual Polarity Property
نویسندگان
چکیده
A method for optimisation of fixed polarity arithmetic expressions (FPAEs) based on dual polarity is proposed. The method exploits a simple relationship between two FPAEs for dual polarities. It starts from the zero polarity FPAE of the given function and calculates all FPAEs using the dual polarity route. Using one-bit check carries out conversion from one FPAE to another. Each term in an FPAE is processed by the proposed processing rule. Terms, which differ in a single position, can be substituted by a high order term (cube). Experimental results show efficiency of proposed method.
منابع مشابه
Optimization of Arithmetic Expressions Using the Dual Polarity Property
In this paper we propose a method for optimization of fixed polarity arithmetic expressions (FPAEs) based on dual polarity. The method exploits a simple relationship between two FPAEs for dual polarities. It starts from the zero polarity FPAE of the given function and calculates all FPAEs using dual polarity route. Conversion from one FPAE to another one is carried out using one-bit checking i....
متن کاملReduction of the Number of Coefficients in Arithmetic Expressions by Autocorrelation Functions
This paper proposes to combine classical approaches to the optimization of arithmetic expressions by choosing polarity of variables with the linearization of switching functions (LSF). Experimental results presented in the paper, show that in classical approaches, transition from Positive-polarity arithmetic expressions to Fixed-polarity arithmetic expressions may provide for 30-40% of reduced ...
متن کاملOptimization of Fixed-polarity Reed-muller Circuits Using Dual-polarity Property*
In the optimization of canonical Reed-Muller (RM) circuits, RM polynomials with different polarities are usually derived directly from Boolean expressions. Time efficiency is thus not fully achieved because the information in finding RM expansion of one polarity is not utilized by others. We show in this paper that two fixed-polarity RM expansions that have the same number of variables and whos...
متن کاملRemarks on Applications of Arithmetic Expressions for Efficient Implementation of Elementary Functions
It has been recently shown in [1], that elementary mathematical functions (as trigonometric, logarithmic, square root, gaussian, sigmoid, etc.) are compactly represented by the Arithmetic transform expressions and related Binary Moment Diagrams (BMDs). The complexity of the representations is estimated through the number of non-zero coefficients in arithmetic expressions and the number of nodes...
متن کاملGeneration of multi-polarity helix transform over GF(3)
In this article, the new multi-polarity helix transform for ternary logic functions has been introduced. In addition, an extended dual polarity property that had been used to optimize Kronecker and quaternary Fixed-Polarity Reed-Muller (FPRM) expressions has been applied to generate efficiently the multi-polarity helix transform over GF(3). The experimental results for the transform are compare...
متن کامل